Locally Testable Codes and Small-Set Expanders
نویسنده
چکیده
The unique games conjecture has been a very influential conjecture with many striking and profound implications. Originally proposed by Khot [Kho02], a positive resolution to the conjecture, would imply that many natural and important questions can be approximated by a basic SDP algorithm (see [Rag08]) and that no algorithm can do better (unless P = NP ). Many important practical problems such as MAX-Cut, Kernel Clustering, Min Vertex Cover all fall under this category (see [KKMO07, KR08, RS09])
منابع مشابه
Locally Testable Codes and Expanders
A locally testable code is a code defined by a robust set of local constraints. Namely, the distance of a vector from the code is well approximated by the fraction of local constraints that it violates. A constraint graph of an LTC is a graph whose vertices are labeled by the coordinates of the code, and vertex i is adjacent to j whenever they occur together in a constraint. We study the relati...
متن کاملQuantum Locally Testable Codes
We initiate the study of quantum Locally Testable Codes (qLTCs). We provide a definition to-gether with a simplification, denoted sLTCs, for the special case of stabilizer codes, and providesome basic results using those definitions. The most crucial parameter of such codes is their sound-ness, R(δ), namely, the probability that a randomly chosen constraint is violated as a func...
متن کاملLecture Notes on Locally Testable Codes and Proofs
In terms of property testing, locally testable codes are error correcting codes such that the property of being a codeword can be tested within low query complexity. As for locally testable proofs (PCPs), these can be viewed as massively parametrized properties that are testable within low query complexity such that the parameterized property is non-empty if and only if the corresponding parame...
متن کاملLimitations on Testable Affine-Invariant Codes in the High-Rate Regime
Locally testable codes (LTCs) of constant minimum (absolute) distance that allow the tester to make a nearly linear number of queries have become the focus of attention recently, due to their connections to central questions in approximability theory. In particular, the binary Reed-Muller code of block length N and absolute distance d is known to be testable with O(N/d) queries, and has a dimen...
متن کاملShort Locally Testable Codes and Proofs: A Survey in Two Parts
We survey known results regarding locally testable codes and locally testable proofs (known as PCPs), with emphasis on the length of these constructs. Local testability refers to approximately testing large objects based on a very small number of probes, each retrieving a single bit in the representation of the object. This yields super-fast approximate-testing of the corresponding property (i....
متن کامل